Replica Placement Algorithms with Latency Constraints in Content Distribution Networks

نویسندگان

  • Jie Su
  • Douglas Reeves
چکیده

Content distribution networks (CDNs) are a recent development to improve the performance of networked applications. The design of replica placement algorithms is one of the foremost problems in CDNs. Current replica placement methods do not guarantee a bound on the maximum latency to any client. In this paper, we propose several algorithms for replica placement with latency constraints. The algorithms are compared with respect to scalability and performance under a variety of conditions, including the case where clients’ request patterns are unknown.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improve Replica Placement in Content Distribution Networks with Hybrid Technique

The increased using of the Internet and its accelerated growth leads to reduced network bandwidth and the capacity of servers; therefore, the quality of Internet services is unacceptable for users while the efficient and effective delivery of content on the web has an important role to play in improving performance. Content distribution networks were introduced to address this issue. Replicatin...

متن کامل

Analysis Study on Caching and Replica Placement Algorithm for Content Distribution in Distributed Computing Networks

Recently there has been significant research focus on distributed computing network massively caching and replica placement problems for content distribution in globally. Peer-to-Peer (P2P) network provides dynamically decentralized, self organized, scalable objects in distributed computing system. However such networks suffer from high latency, network traffic and cache update problems. The ex...

متن کامل

Do We Need Replica Placement Algorithms in Content Delivery Networks?

Numerous replica placement algorithms have been proposed in the literature for use in content delivery networks. However, little has been done to compare the various placement algorithms against each other and against caching. This paper debates whether we need replica placement algorithms in content delivery networks or not. The paper uses extensive evaluation of algorithms, systems and web wo...

متن کامل

Heuristic Replica Placement Algorithms in Content Distribution Networks

Content Distribution Networks have been attracted a great deal of attraction in recent years. Replica placement problems (RPPs) as one of the key technologies in the Content Distribution Networks have been widely studied. In this paper, we propose an optimization model with server storage capacity constraints for the RPPs. Furthermore, part of the objective function is represented as a Multiple...

متن کامل

On the Placement of Web Server Replicas

Recently there has been an increasing deployment of content distribution networks (CDNs) that offer hosting services to Web content providers. CDNs deploy a set of servers distributed throughout the Internet and replicate provider content across these servers for better performance and availability than centralized provider servers. Existing work on CDNs has primarily focused on techniques for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003